Unsourced Random Massive Access With Beam-Space Tree Decoding
نویسندگان
چکیده
The core requirement of massive Machine-Type Communication (mMTC) is to support reliable and fast access for an enormous number machine-type devices (MTDs). In many practical applications, the base station (BS) only concerns list received messages instead source information, introducing emerging concept unsourced random (URA). Although some multiple-input multiple-output (MIMO) URA schemes have been proposed recently, unique propagation properties millimeter-wave (mmWave) MIMO systems are not fully exploited in conventional schemes. grant-free access, BS cannot perform receive beamforming independently as identities active users unknown BS. Therefore, intrinsic beam division property can be improve decoding performance. this paper, a scheme based on beam-space tree mmWave system. Specifically, two decoders designed hard decision soft decision, respectively, utilize property. They both leverage assist discriminating sub-blocks transmitted from different users. Besides, first decoder reduce searching space, enjoying low complexity. second exploits advantage recover miss-detected packets. Simulation results verify superiority compared terms error probability.
منابع مشابه
A Logarithmic Random Access Tree
Making a data structure that performs like a dynamic array but functions in logarithmic time for all operations is the goal, but is by no means a trivial one. The obvious solution is to use a tree of some sort, but how? By using a binary tree in which values are stored at the leaf nodes and each node keeps track of how many leaves there are below it, we can quickly achieve logarithmic random ac...
متن کاملRate-storage regions for Massive Random Access
This paper introduces a new source coding paradigm called Sequential Massive Random Access (SMRA). In SMRA, a set of correlated sources is encoded once for all and stored on a server, and clients want to successively access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server is only allowed to extract a bitstream from the stored data: no re-encoding...
متن کاملSparse Combinatorial Group Testing for Low-Energy Massive Random Access
We present random access schemes for machine-type communication where a massive number of low-energy wireless devices want to occasionally transmit short information packets. We focus on the device discovery problem, with extensions to joint discovery and data transmission as well as data transmission without communicating device identities. We formulate this problem as a combinatorial group te...
متن کاملSign-Compute-Resolve for Tree Splitting Random Access
We present an approach to random access that is based on three elements: physical-layer network coding (PLNC), signature codes and tree splitting. In presence of a collision, physical-layer network coding enables the receiver to decode, i.e., compute the sum of the packets that were transmitted by the individual users. For each user, the packet consists of the user’s signature, as well as the d...
متن کاملFast and constant time random access decoding with log2n block seek time
For faster random access of a target image block, a bi-section idea is applied to link image blocks. Conventional methods configure the blocks in linearly linked way, for which the block seek time entirely depends on the location of the block on the compressed bitstream. The block linkage information is configured such that binary search is possible, giving the worst case block seek time of dlo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2022
ISSN: ['0733-8716', '1558-0008']
DOI: https://doi.org/10.1109/jsac.2022.3143241